Rule for U p d a t i n g Evidence
نویسنده
چکیده
Abstrac t . In probabilistic reasoning when we have to build a probability distribution on some events and no further information is available, we then apply the insufficient reasoning principle; i.e. we assume that the events have equal opportunities to occur. In our previous work we have observed that in the Dempster-Shafer theory of evidence the principle is not applied when using Dempster's rule of combination to combine evidence. In this paper we propose a new rule, proportional sum, for updating evidence. A comparison of this rule with Dempster's rule of combination shows that the new rule updates evidence, corresponding to the point of view of belief as generalized probability, while Dempster's rule of combination combines evidence, corresponding to the point of view of belief as evidence as indicated by Halpern and Fagin. Then we have two rules within one framework: one is for combining evidence and another is for updating evidence.
منابع مشابه
Amitraz Poisoning; A case study
A m i t r a z, a n i ns e c t i c i d e /a ca ri c i de of the f o r m a m i d i n e p e st i c i d e s group, is a ? 2 a d r e n e r g i c ag on i st a nd of t he a m i d i ne c h e m i ca l f a m il y generally us e d to c o n t r ol animal e c top a r a s i t e s. Poisoning due to am i t r a z i s r a r e and character...
متن کاملTotal domination in cubic Knodel graphs
A subset D of vertices of a graph G is a dominating set if for each u ∈ V (G) \ D, u is adjacent to somevertex v ∈ D. The domination number, γ(G) ofG, is the minimum cardinality of a dominating set of G. A setD ⊆ V (G) is a total dominating set if for eachu ∈ V (G), u is adjacent to some vertex v ∈ D. Thetotal domination number, γt (G) of G, is theminimum cardinality of a total dominating set o...
متن کاملTotal domination in $K_r$-covered graphs
The inflation $G_{I}$ of a graph $G$ with $n(G)$ vertices and $m(G)$ edges is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(u,v)$ in such a way that $uin X_{i}$, $vin X_{j}$, and two different edges of $G$ are replaced by non-adjacent edges of $G_{I}$. T...
متن کاملInexact Inference for Rule - Based Damage
The knowledge o r g a n i z a t i o n of a r u l e -based damage assessment system of e x i s t i n g s t r u c t u r e s subj e c t e d t o ear thquake e x c i t a t i o n i s o u t l i n e d i n t h i s p a p e r . A p r i n c i p l e o f i nexac t i n f e r e n c e to o b t a i n a r a t i o n a l s o l u t i o n i s p r e s e n t e d . The f u z zy set t heo ry and the p r o d u c t i o n s...
متن کاملAn Interactive phonological Rule Testing System
One of t he many ways t he h i g h s p e e d computer i s u s e f u l t o l i n g u i s t i c r e s e a r c h e r s i s f o r t h e e v a l u a t i o n of g e n e r a t i v e grammars. S e v e r a l p r o ~ s ~ i n g sys t ems f o r t h i s purpose have been d e s c r i b e d i n the l i t e r a t u r e . 1 , 2 , 3 , ~ A t r a n s f o r m a t i o n a l g e n e r a t i v e grammar c o n s i s t ...
متن کاملAdaptive Systems in Control and Signal Processing 1986
The MIT r u l e is a s c a l a r parameter ad jus tment law which was proposed i n 1961 f o r t h e model reference a d a p t i v e c o n t r o l of l i n e a r sys tems modeled as t h e cascade of a known s t a b l e p l a n t and a s i n g l e unknown g a i n . T h i s ad jus tment law was derived by approx imat ing a g r a d i e n t d e s c e n t prOCedUPe f o r an i n t e g r a l error s q ...
متن کامل